the combinatorial multi-mode resource constrained multi-project scheduling problem

this paper presents the formulation and solution of the combinatorial multi-mode resource constrained multi-project scheduling problem. the focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. the motivation for developing such an approach is due in part to practical situations where the definition of optimal changes on a regular basis. the proposed approach empowers the project manager to determine what is optimal, on a given day, under the current constraints, such as, change of priorities, lack of skilled worker. the proposed method utilizes a simulation approach to determine feasible solutions, under the current constraints. resources can be non-consumable, consumable, or doubly constrained. the paper also presents a real-life case study dealing with scheduling of ship repair activities.